Towards Real-Time Stereo Employing Parallel Algorithms For Edge-Based And Dense Stereo Matching
نویسندگان
چکیده
Only few problems in computer vision have been investigated more vigorously than stereo. Nevertheless, the main obstacle on the way to their practical application is the excessively long computation time needed to match stereo images. This paper presents parallel algorithms for edge-based stereo suitable for depth computation. Edge-based stereo techniques produce only sparse depth maps. Thus, we present in addition an efficient parallel algorithm for dense stereo matching that can be employed in scene reconstruction. Both approaches are implemented on several different computers to measure the performance. We compared single processor and multiple processor implementations to evaluate the profit of parallel realizations. Results are presented in this paper. We show that both approaches are very suitable for parallel implementations and that computing time can be considerably reduced with parallel implementations. Furthermore, we present the results that are obtained when employing the different approaches to stereo images.
منابع مشابه
Optimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملWindow-based approach for fast stereo correspondence
In this study, the authors present a new area-based stereo matching algorithm that computes dense disparity maps for a real-time vision system. Although many stereo matching algorithms have been proposed in recent years, correlation-based algorithms still have an edge because of speed and less memory requirements. The selection of appropriate shape and size of the matching window is a difficult...
متن کاملRobust Real-Time Stereo Edge Matching by Confidence-Based Refinement
Edges are important features for tasks like object detection and vision-based navigation. In this paper, a novel real-time capable stereo edge refinement technique is presented. It propagates confidence and consistency along the detected edges, which reduces false matches significantly. Unmatched pixels are safely recovered by interpolation. We also investigate suitable support regions for edge...
متن کاملReal time sparse and dense stereo in an early cognitive vision system using CUDA
This master’s thesis proceeds the work done in my FORK. Here we investigate how the introduction of a CUDA enabled graphics card can speed up the algorithms involved during the stereo computation of the CoViS framework. Stereo matching and reconstruction in general tend to be computationally heavy, and the support for parallel execution motivates us to transfer known algorithms to the massively...
متن کاملNew Pseudo-CT Generation Approach from Magnetic Resonance Imaging using a Local Texture Descriptor
Background: One of the challenges of PET/MRI combined systems is to derive an attenuation map to correct the PET image. For that, the pseudo-CT image could be used to correct the attenuation. Until now, most existing scientific researches construct this pseudo-CT image using the registration techniques. However, these techniques suffer from the local minima of the non-rigid deformation energy f...
متن کامل